منابع مشابه
Polynomial Supertree Methods Revisited
Supertree methods allow to reconstruct large phylogenetic trees by combining smaller trees with overlapping leaf sets into one, more comprehensive supertree. The most commonly used supertree method, matrix representation with parsimony (MRP), produces accurate supertrees but is rather slow due to the underlying hard optimization problem. In this paper, we present an extensive simulation study c...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملPolynomial Methods in Combinatorial Geometry
iii 1 The Erdős Distance Problem 1 2 Incidence Geometry 5 2.1 The distinct distances incidence problem . . . . . . . . . . . . . . . . . 5 2.2 The geometry of Elekes’ incidence problem . . . . . . . . . . . . . . . . 11 2.3 Ruled Surfaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 3 Dvir’s Polynomial Method 17 3.1 The Polynomial Method . . . . . . . . . . . . . . . . . . ....
متن کاملLocal Piecewise Polynomial Projection Methods
Local projection methods which yield c'm_1) piecewise polynomials of order m + k as approximate solutions of a boundary value problem for an mth order ordinary differential equation are determined by the k linear functional at which the residual error in each partition interval is required to vanish on. We develop a condition on these k f unctionals which implies breakpoint superconvergence (of...
متن کاملPolynomial Supertree Methods in Phylogenomics
One of the objectives in modern biology, especially phylogenetics, is to build larger clades of the Tree of Life. Large-scale phylogenetic analysis involves several serious challenges. The aim of this thesis is to contribute to some of the open problems in this context: Perhaps most important in general is the design of fast and efficient algorithms to reconstruct large phylogenetic trees. In o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Robust and Nonlinear Control
سال: 2007
ISSN: 1049-8923,1099-1239
DOI: 10.1002/rnc.1126